منابع مشابه
Compiling Nondeterministic Computations Pem
Implementing a compiler for such a language with nonde-terministic features is known to be a diicult task. This paper presents two new functions setChoicePoint and fail that extend the C language to eeciently handle choice point management. Algorithms and implementation techniques are detailed. As an application, we give compilation schemes to illustrate the power and the easy use of setChoiceP...
متن کاملShorter arithmetization of nondeterministic computations
Arithmetizing computation is a crucial component of many fundamental results in complexity theory, including results that gave insight into the power of interactive proofs, multi-prover interactive proofs, and probabilistically-checkable proofs. Informally, an arithmetization is a way to encode a machine’s computation so that its correctness can be easily verified via few probabilistic algebrai...
متن کاملEnumeration Reducibility, Nondeterministic Computations and Relative Computability of Partial Functions
In a computation using auxiliary informational inputs one can think of the external resource making itself available in different ways. One way is via an oracle as in Turing reducibility, where information is supplied on demand without any time delay. Alternatively the Scott graph model for lambda calculus suggests a situation where new information, only some of it immediately related to the cu...
متن کاملNondeterministic One-Tape Off-Line Turing Machines
Finite state control Semi-infinite tape which contains, at the beginning of the computation: the input string, on its part of the tape the blank symbol, in the remaining squares According to the transition function at each step the machine: changes its internal state writes a nonblank symbol on the scanned tape square moves the head either to the left, or to the right, or keeps it on the same s...
متن کاملNondeterministic one-tape off-line Turing machines and their time complexity
In this paper we consider the time and the crossing sequence complexities of onetape off-line Turing machines. We show that the running time of each nondeterministic machine accepting a nonregular language must grow at least as n logn, in the case all accepting computations are considered (accept measure). We also prove that the maximal length of the crossing sequences used in accepting computa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2019
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s012905411940029x